Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Geometric Problems
This chapter surveys approximation algorithms for hard geometric problems. The problems we consider typically take inputs that are point sets or polytopes in twoor three-dimensional space, and seek optimal constructions, (which may be trees, paths, or polytopes). We limit attention to problems for which no polynomial-time exact algorithms are known, and concentrate on bounds for worst-case appr...
متن کاملApproximation Algorithms for Geometric Optimization Problems
This thesis deals with a number of geometric optimization problems which are all NP-hard. The first problem we consider is the set cover problem for polytopes in R3. Here, we are given a set of points in R3 and a fixed set of translates of an arbitrary polytope. We would like to select a subset of the given polytopes such that each input point is covered by at least one polytope and the number ...
متن کاملApproximation Algorithms for Geometric Median Problems
In this paper we present approximation algorithms for median problems in metric spaces and xed-dimensional Euclidean space. Our algorithms use a new method for transforming an optimal solution of the linear program relaxation of the s-median problem into a provably good integral solution. This transformation technique is fundamentally di erent from the methods of randomized and deterministic ro...
متن کاملApproximation Algorithms for Geometric Separation Problems
In computer graphics and solid modeling, one is interested in representing complex geometric objects with combinatorially simpler ones. It turns out that via a “fattening” transformation, one obtains a formulation of the approximation problem in terms of separation: Find a minimumcomplexity surface that separates two sets. In this paper, we provide approximation algorithms for several geometric...
متن کاملApproximation Algorithms for Budget Constrained Network Upgradeable Problems
We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph G = (V,E) where the weight an edge e ∈ E can be upgraded for a cost c(e). Given a budget B for improvement, the goal is to find a subset of edges to be upgraded so that the resulting network is optimum for B. The results obtained in this paper include the following. 1. Maximum Weight Constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2018
ISSN: 1999-4893
DOI: 10.3390/a11040045